RSFQ 4-bit Bit-Slice Integer Multiplier
نویسندگان
چکیده
منابع مشابه
An Area-Efficient Bit-Serial Integer Multiplier
This paper presents the design of a new multiplier architecture for normal integer multiplication of positive and negative numbers. It has been developed to increase the performance of algorithms for cryptographic and signal processing applications on implementations of the Instruction Systolic Array (ISA) parallel computer model [6,7]. The multiplier operates least significant bit (LSB)-first....
متن کاملDesign of High Speed Hardware Efficient 4-bit Sfq Multiplier
A 2-bit Booth encoder with Josephson Transmission Lines (JTLs) and Passive Transmission Lines (PTLs) is designed. The Booth encoding method is one of the algorithms to obtain partial products. With this method, the number of partial products decreases down to the half compared to the AND array method. The circuit area of the multiplier designed with the Booth encoder method is compared to that ...
متن کاملComparative Design of 16-Bit Sparse-Tree Rsfq Adder
In this paper, we propse 16-bit sparse tree RSFQ adder (Rapid single flux quantam), kogge-stone adder, carry lookahead adder. In general N-bit adders like Ripple carry adder s(slow adders compare to other adders), and carry lookahead adders(area consuming adders) are used in earlier days. But now the most of industries are using parallel prefix adders because of their advantages compare to kogg...
متن کاملEight Bit Serial Triangular Compressor Based Multiplier
This paper proposes a novel and area efficient bit serial multiplier architecture in which both the multiplier and multiplicand are processed in real time. The major advantage of proposed multiplier is the bit serial data which results in reduced area and simple circuitry, the use of compressor enables us to get bit serial out put every clock cycle. The proposed architecture is best suited for ...
متن کاملThe Verification of a Bit-slice ALU
The verification of a bit-slice ALU has been accomplished using a mechanical theorem prover. This ALU has an n-bit design specification, which has been verified to implement its top-level specification. The ALU and top-level specifications were written in the Boyer-Moore logic. The verification was carried out with the aid of Boyer-Moore theorem prover in a hierarchical fashion.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Electronics
سال: 2016
ISSN: 0916-8524,1745-1353
DOI: 10.1587/transele.e99.c.697